Forcing Large Complete (Topological) Minors in Infinite Graphs

نویسندگان

  • Maya Jakobine Stein
  • José Zamora
چکیده

It is well known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalize the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large minimum degree at the vertices imply the existence of large complete (topological) minors in infinite graphs with countably many ends.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forcing large complete minors in infinite graphs

It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...

متن کامل

Normal Tree Orders for Infinite Graphs

A well-founded tree T denned on the vertex set of a graph G is called normal if the endvertices of any edge of G are comparable in T. We study how normal trees can be used to describe the structure of infinite graphs. In particular, we extend Jung's classical existence theorem for trees of height w to trees of arbitrary height. Applications include a structure theorem for graphs without large c...

متن کامل

Unavoidable topological minors of infinite graphs

A graph G is loosely-c-connected, or l-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite component and a graph containing at most d vertices. In this paper, we give the structure of a set of l-c-connected infinite graphs that form an unavoidable set among the topological minors of l-c-connected infinite gr...

متن کامل

Dominating functions and topological graph minors

An infinite graph G is called dominating if its vertices can be labelled with natural numbers in such a way that for every function f : ω→ ω there is a ray in G whose sequence of labels eventually exceeds f . Conversely, G is called bounded if for every labelling of its vertices with natural numbers there exists a function f : ω→ω which eventually exceeds the labelling along any ray in G. This ...

متن کامل

On the existence of special depth first search trees

The Depth First Search (DFS) algorithm is one of the basic techniques which is used in a very large variety of graph algorithms. Most applications of the DFS involve the construction of a depth-first spanning tree (DFS tree). In this paper, we give a complete characterization of all the graphs in which every spanning tree is a DFS tree. These graphs are called Total −DFS −Graphs. We prove that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2013